A Fully Complete PER Model forML Polymorphic

Fully Complete Models for ML Polymorphic Types

We present an axiomatic characterization of models fully-complete for ML-polymorphic types of system F. This axiomatization is given for hyperdoctrine models, which arise as adjoint models, i.e. co-Kleisli categories of suitable linear categories. Examples of adjoint models can be obtained from categories of Partial Equivalence Relations over Linear Combinatory Algebras. We show that a special ...

Full Abstraction for Polymorphic Pi-Calculus

The problem of finding a fully abstract model for the polymorphic π-calculus was stated in Pierce and Sangiorgi’s work in 1997 and has remained open since then. In this paper, we show that a slight variant of their language has a direct fully abstract model, which does not depend on type unification or logical relations. This is the first fully abstract model for a polymorphic concurrent langua...

A complete axiomatization forML!1

In this paper we present a completeness theorem for the innnitary modal logic ML !1. The proof is based on the new notion of an innnitary modal consistency property. 1

A Feature-Oriented Requirements Modelling Language (FORML)

Axiomatizing Fully Complete Models for ML Polymorphic Types

We present axioms on models of system F, which are suu-cient to show full completeness for ML-polymorphic types. These axioms are given for hyperdoctrine models, which arise as adjoint models, i.e. co-Kleisli categories of linear categories. Our axiomatization consists of two crucial steps. First, we axiomatize the fact that every relevant morphism in the model generates, under decomposition, a...